منابع مشابه
Perturbation of central transportation polytopes of order kn× n
We describe a perturbation method that can be used to compute the multivariate generating function (MGF) of a non-simple polyhedron, and then construct a perturbation that works for any transportation polytope. Applying this perturbation to the family of central transportation polytopes of order kn × n, we obtain formulas for the MGF of the polytope. The formulas we obtain are enumerated by com...
متن کاملGraphs of transportation polytopes
Article history: Received 17 October 2007 Available online 28 April 2009
متن کاملInformation-geometric equivalence of transportation polytopes
This paper deals with transportation polytopes in the probability simplex (that is, sets of categorical bivariate probability distributions with prescribed marginals). Information projections between such polytopes are studied, and a sufficient condition is described under which these mappings are homeomorphisms. 1. Preliminaries Let Γn denote the set of probability distributions with alphabet ...
متن کاملOn the Number of Faces of Certain Transportation Polytopes
Define the transportation polytope Tn,m to be a polytope of non-negative n×m matrices with row sums equal to m and column sums equal to n. We present a new recurrence relation for the numbers fk of the k-dimensional faces for the transportation polytope Tn,n+1. This gives an efficient algorithm for computing the numbers fk , which solves the problem known to be computationally hard in a general...
متن کاملThe Hierarchy of Circuit Diameters and Transportation Polytopes
The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear programming. While transportation polytopes are at the core of operations research and statistics it is still open whether the Hirsch conjecture is true for general m×n–transportation polytopes. In earlier work the first three authors introduced a hierarchy of variations to the notion of graph dia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2013
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2013.05.003